On-line Path Generation for Small Unmanned Aerial Vehicles Using B-Spline Path Templates

نویسندگان

  • Dongwon Jung
  • Panagiotis Tsiotras
چکیده

In this study we investigate the problem of generating a smooth, planar reference path, given a family of discrete optimal paths. In conjunction with a path representation by a finite sequence of square cells, the generated path is supposed to stay inside a feasible channel, while minimizing certain performance criteria. Constrained optimization problems are formulated subject to geometric (linear) constraints, as well as boundary conditions in order to generate a library of B-spline path templates. As an application to the vehicle motion planning, the path templates are incorporated to represent local segments of the entire path as geometrically smooth curves, which are then joined with one another to generate a reference path to be followed by a closed-loop tracking controller. The on-line path generation algorithm incorporates the path templates such that continuity and smoothness are preserved when switching from one template to another along the path. Combined with the D∗-lite path planning algorithm, the proposed algorithm provides a complete solution to the obstacle-free path generation problem in a computationally efficient manner, suitable for real-time implementation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-Line Path Generation for Unmanned Aerial Vehicles Using B-Spline Path Templates

The problem of generating a smooth reference path, given a finite family of discrete, locally optimal paths, is investigated. A finite discretization of the environment results in a sequence of obstacle-free square cells. The generated path must lie inside the channel generated by these obstacle-free cells, while minimizing certain performance criteria. Two constrained optimization problems are...

متن کامل

Dynamically Feasible Probabilistic Motion Planning in Complex Environments for UAVs

In this work, we consider the problem of generating practically implementable path plan for flying unmanned aerial vehicles in 3D Complex environments. This problem is complicated by the fact that, generation of the dynamically and geometrically feasible flight trajectories for agile maneuver profiles requires search of nonlinear state space of the aircraft dynamics. This work suggests a two st...

متن کامل

Contour Based Path Planning with B-Spline Trajectory Generation for Unmanned Aerial Vehicles (UAVs) over Hostile Terrain

This research focuses on trajectory generation algorithms that take into account the stealthiness of autonomous UAVs; generating stealthy paths through a region laden with enemy radars. The algorithm is employed to estimate the risk cost of the navigational space and generate an optimized path based on the user-specified threshold altitude value. Thus the generated path is represented with a se...

متن کامل

Three-dimensional Path Planning of Unmanned Aerial Vehicles Using Particle Swarm Optimization

Military operations are turning to more complex and advanced automation technology for minimum risk and maximum efficiency. A critical piece to this strategy is unmanned aerial vehicles (UAVs). UAVs require the intelligence to safely maneuver along a path to an intended target, avoiding obstacles such as other aircrafts or enemy threats. Often automated path planning algorithms are employed to ...

متن کامل

Evolutionary algorithm based offline/online path planner for UAV navigation

An evolutionary algorithm based framework, a combination of modified breeder genetic algorithms incorporating characteristics of classic genetic algorithms, is utilized to design an offline/online path planner for unmanned aerial vehicles (UAVs) autonomous navigation. The path planner calculates a curved path line with desired characteristics in a three-dimensional (3-D) rough terrain environme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008